package rladidxo.basic;

import java.util.Scanner;

public class J05_NumberPiramid {
	public static void main(String[] args) {
		Scanner scanner=new Scanner(System.in);
		System.out.println("Enter the number of lines (1~7사이의 숫자):");
		int number = scanner.nextInt();
		int a=1,b=1,c=0;
		while(b>0){
		switch(b){
		case 1:System.out.println("	"+"	"+"	"+"	"+"	"+"	"+"	"+(b));if(number==1){break;}
		case 2:System.out.println("	"+"	"+"	"+"	"+"	"+"	"+(b+1)+"	"+(b)+"	"+(b+1));if(number==2){break;}
		case 3:System.out.println("	"+"	"+"	"+"	"+"	"+(b+2)+"	"+(b+1)+"	"+(b+0)+"	"+(b+1)+"	"+(b+2));if(number==3){break;}
		case 4:System.out.println("	"+"	"+"	"+"	"+(b+3)+"	"+(b+2)+"	"+(b+1)+"	"+(b+0)+"	"+(b+1)+"	"+(b+2)+"	"+(b+3));if(number==4){break;}
		case 5:System.out.println("	"+"	"+"	"+(b+4)+"	"+(b+3)+"	"+(b+2)+"	"+(b+1)+"	"+(b+0)+"	"+(b+1)+"	"+(b+2)+"	"+(b+3)+"	"+(b+4));if(number==5){break;}
		case 6:System.out.println("	"+"	"+(b+5)+"	"+(b+4)+"	"+(b+3)+"	"+(b+2)+"	"+(b+1)+"	"+(b+0)+"	"+(b+1)+"	"+(b+2)+"	"+(b+3)+"	"+(b+4)+"	"+(b+5));if(number==6){break;}
		case 7:System.out.println("	"+(b+6)+"	"+(b+5)+"	"+(b+4)+"	"+(b+3)+"	"+(b+2)+"	"+(b+1)+"	"+(b+0)+"	"+(b+1)+"	"+(b+2)+"	"+(b+3)+"	"+(b+4)+"	"+(b+5)+"	"+(b+6));if(number==7){break;}
		}b++;break;
		}
		}
		
	}



